Journeys in non-classical computation II: initial journeys and waypoints
نویسندگان
چکیده
†University of York, Heslington, York YO1 5DD, UK ‡University of the West of England, Frenchay Campus, Coldharbourlane, Bristol BS16 1QY, UK {University of Portsmouth, Buckingham Building, Lion Terrace, Portsmouth PO1 3WE, UK §University of Kent, Canterbury, Kent CT2 7NZ, UK kUniversity of Cambridge, Madingley Road, Cambridge CB3 OHE, UK #University of Exeter, North Cote House, The Queen’s Drive, Exeter E4 4QJ, UK
منابع مشابه
A comparative Survey on the Stages of Philosophical Training in Plato’s Allegory of Cave, in the Four Mystical Journeys, and in Mulla Sadra’s al-Asfar
At the beginning of his magnum opus al-Hekmat al-Muta’aleiat fi al-Asfar al-Aqliiat, Mulla Sadra says that he has nominated and arranged his book according to “the four journeys” of the Mystics. What he and the Mystics say on these journeys reminds those familiar with Greek philosophy of Plato’s Phaedrus and Republic (Journey of souls onto sky and the Allegory of Cave, respectively). In spite o...
متن کاملJourneys in Non-Classical Computation
Today’s computing, classical computing, is a remarkable success story. However, there is a growing appreciation that it encompasses only a small subset of all computational possibilities. There are several paradigms that seem to define classical computing, but these may not be true for all of computation. As these paradigms are systematically challenged, the subject area is widened and enriched...
متن کاملComputing and Evaluating Multimodal Journeys
We study the problem of finding multimodal journeys in transportation networks, including unrestricted walking, driving, cycling, and schedule-based public transportation. A natural solution to this problem is to use multicriteria search, but it tends to be slow and to produce too many journeys, several of which are of little value. We propose algorithms to compute a full Pareto set and then sc...
متن کاملDifferent Optimal Solutions in Shared Path Graphs
We examine an expansion upon the basic shortest path in graphs problem. We define journeys to be source-destination pairs in weighted and connected graphs, and allow them to equally split the cost of shared edges. In this new problem, there are multiple possible definitions of optimality. We investigate three: minimizing the total resources—the sum of the journeys’ costs— of a graph’s journeys;...
متن کاملComputing Shortest, Fastest, and Foremost Journeys in Dynamic Networks
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJPEDS
دوره 21 شماره
صفحات -
تاریخ انتشار 2006